Journal of Complex Networks, 177–186 doi:comnet/cnv020 Advance Access publication on 21 July 2015 Network installation under convex costs Alexander Gutfraind†

Source URL: www.levreyzin.com

• NP-complete problems
• Clique problem
• Vertex cover
• Clique
• Independent set
• Bipartite graph
• Travelling salesman problem
• Graph coloring
• Line graph
• Treewidth
• Pathwidth

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Source URL: theory.stanford.edu

• NP-complete problems
• Computational complexity theory
• Analysis of algorithms
• Operations research
• NP-hard problems
• Vertex cover
• Travelling salesman problem
• Dynamic programming
• Parameterized complexity
• Independent set
• Algorithm
• 2-satisfiability

CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014

Source URL: theory.stanford.edu

• NP-complete problems
• Approximation algorithm
• Independent set
• Algorithm
• Maximal independent set
• Longest path problem
• Vertex cover

Selecting a Comprehensive Set of Reviews Panayiotis Tsaparas Alexandros Ntoulas∗ Evimaria Terzi†

Source URL: www.cs.uoi.gr

• Data mining
• NP-complete problems
• Submodular set function
• Greedy algorithm
• Algorithm
• Automatic summarization
• XTR
• Set cover problem

IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. 5, NO. 2,

Source URL: community.dur.ac.uk

• NP-complete problems
• NP
• Set cover problem
• Vertex cover
• Thorn
• Approximation algorithm

CS261: A Second Course in Algorithms Lecture #15: Introduction to Approximation Algorithms∗ Tim Roughgarden† February 23, 2016

Source URL: theory.stanford.edu

• NP-complete problems
• Knapsack problem
• Set cover problem
• Steiner tree problem
• Vertex cover
• Approximation algorithm
• Greedy algorithm
• Dynamic programming
• Minimum spanning tree
• Algorithm
• Time complexity
• NP

Interference in Cellular Networks: The Minimum Membership Set Cover Problem Fabian Kuhn1 , Pascal von Rickenbach1 , Roger Wattenhofer1 , Emo Welzl2 , and Aaron Zollinger1 , , watt

Source URL: disco.ethz.ch

• Set cover problem
• Randomized rounding
• Pi
• Probability distributions

A Θ(log n)-approximation for the Set Cover Problem with Set Ownership Mira Gonen 1 and Yuval Shavitt 2 School of Electrical Engineering, Tel Aviv University, Ramat Aviv 69778, Israel. Abstract

Source URL: www.eng.tau.ac.il

Approximating Fault-Tolerant Domination in General Graphs Klaus-Tycho Foerster∗ Abstract In this paper we study the NP-complete problem of finding small k-dominating sets in general graphs, which allow k − 1 nodes to

Source URL: www.tik.ee.ethz.ch

• Graph theory
• Mathematics
• Computational complexity theory
• NP-complete problems
• Dominating set
• Independent set
• Vertex cover
• Connected dominating set
• Set cover problem
• Line graph
• Metric k-center
• Domatic number

PY 542: Non-Equilibrium Statistical Physics Problem Set 6, Fall 2011 Reading: This week we will cover aggregation phenomena, as presented in sections 5.1–5 of the text. Please read these sections.

Source URL: physics.bu.edu